Isomorphism of graph classes related to the circular-ones property
نویسندگان
چکیده
Cheriton School of Computer Science, University of Waterloo CONICET, Instituto de Cálculo and Departamento de Computación, FCEyN, Universidad de Buenos Aires Computer Science Department, Colorado State University The Blavatnik School of Computer Science, Tel Aviv University CONICET, Departamento de Computación, FCEyN, Universidad de Buenos Aires EECS Department, Vanderbilt University Universidade Federal do Rio de Janeiro, Instituto de Matemática
منابع مشابه
On the Isomorphism Problem for Helly Circular-Arc Graphs
The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of circular arcs that satisfy the Helly property. We solve the isomorphism problem for this class in logarithmic space. If an input graph has a Helly circular-ar...
متن کاملCharacterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighbourhood of each vertex is an interval in the enumeration. In this work, we give a minimal forbidden induced subgraph characterization for the class of concave-round graphs, solving a problem posed by Bang-Jensen, Huang, and Yeo [SIAM J Discrete Math, 13:179– 193, 2000]. In addition, we show that it is...
متن کاملThe sum-annihilating essential ideal graph of a commutative ring
Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$is called an annihilating ideal if there exists $rin Rsetminus {0}$ such that $Ir=(0)$ and an ideal $I$ of$R$ is called an essential ideal if $I$ has non-zero intersectionwith every other non-zero ideal of $R$. Thesum-annihilating essential ideal graph of $R$, denoted by $mathcal{AE}_R$, isa graph whose vertex set is the set...
متن کاملSolving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace
We present a logspace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where canonical means that models of isomorphic graphs are equal. This implies that the recognition and the isomorphism problems for this class of graphs are solvable in logspace. For a broader class of concave-round graphs, that still possess (not necessary proper) circular-arc...
متن کاملCombinatorial Problems on H-graphs
Biró, Hujter, and Tuza introduced the concept of H-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph H. They naturally generalize many important classes of graphs, e.g., interval graphs and circular-arc graphs. We continue the study of these graph classes by considering coloring, clique, and isomorphism problems on H-graphs. We show that for any fixed H conta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 15 شماره
صفحات -
تاریخ انتشار 2013